On the Construction of Automata from Linear Arithmetic Constraints
نویسندگان
چکیده
This paper presents an overview of algorithms for constructing automata from linear arithmetic constraints. It identifies one case in which the special structure of the automata that are constructed allows a linear-time determinization procedure to be used. Furthermore, it shows through theoretical analysis and experiments that the special structure of the constructed automata does, in quite a general way, render the usual upper bounds on automata operations vastly overpessimistic.
منابع مشابه
Efficient Symbolic Representations for Arithmetic Constraints in Verification
Received (received date) Revised (revised date) Communicated by Editor's name ABSTRACT In this paper we discuss eecient symbolic representations for innnite-state systems speciied using linear arithmetic constraints. We give algorithms for constructing nite automata which represent integer sets that satisfy linear constraints. These automata can represent either signed or unsigned integers and ...
متن کاملConvex Hull of Arithmetic Automata
Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to represent the whole set of solutions of complex linear constraints combining both integral and real variables. In this paper, the closed convex hull of arithmetic automata is proved rational polyhedral. Moreover an algorithm comp...
متن کاملEdge Detection Based On Nearest Neighbor Linear Cellular Automata Rules and Fuzzy Rule Based System
Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...
متن کاملA new view on fuzzy automata normed linear structure spaces
In this paper, the concept of fuzzy automata normed linear structure spaces is introduced and suitable examples are provided. ;The ;concepts of fuzzy automata $alpha$-open sphere, fuzzy automata $mathscr{N}$-locally compact spaces, fuzzy automata $mathscr{N}$-Hausdorff spaces are also discussed. Some properties related with to fuzzy automata normed linear structure spaces and fuzzy automata $ma...
متن کاملLecture Notes in Computer Science 7385
In the last decade, advances in satisfiability-modulo-theories (SMT) solvers have powered a new generation of software tools for verification and testing. These tools transform various program analysis problems into the problem of satisfiability of formulas in propositional or first-order logic, where they are discharged by SMT solvers, such as Z3 from Microsoft Research. This paper briefly sum...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000